A Decidable Fragment of Second Order Linear Logic
نویسنده
چکیده
Existentially quantiied variables are the source of non decid-ability for second order linear logic without exponentials (MALL2). We propose a decision procedure for a fragment of MALL2 based on a canon-ical instantiation of these variables and using inference permutability in proofs.
منابع مشابه
The Undecidability of Second Order Linear Logic Without Exponentials
Recently, Lincoln, Scedrov and Shankar showed that the multi-plicative fragment of second order intuitionistic linear logic is undecidable, using an encoding of second order intuitionistic logic. Their argument applies to the multiplicative-additive fragment, but it does not work in the classical case, because second order classical logic is decidable. Here we show that the multiplicative-addit...
متن کاملA Decidable Fragment of Second Order Logic With Applications to Synthesis
We propose a fragment of many-sorted second order logic ESMT and show that checking satisfiability of sentences in this fragment is decidable. This logic has an $\exists^*\forall^*$ quantifier prefix that is conducive to modeling synthesis problems. Moreover, it allows reasoning using a combination of background theories provided that they have a decidable satisfiability problem for the $\exist...
متن کاملDecidable fragment of first-order temporal logics
In this paper, we introduce a new fragment of the first-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator (Since or Until) have at most one free variable. We show that the satisfiability problem for monodic formulas in various linear time structures can be reduced to the satisfiability problem for a certain fragment of classical first...
متن کاملDecidable fragments of first-order temporal logics
In this paper, we introduce a new fragment of the first-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator (Since or Until) have at most one free variable. We show that the satisfiability problem for monodic formulas in various linear time structures can be reduced to the satisfiability problem for a certain fragment of classical first...
متن کاملMonadic Second Order Finite Satisfiability and Unbounded Tree-Width
The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese [24]. We prove that the following problem is decidable: Input: (i) A monadic second order logic sentence α, and (ii) a sentence β in the two-variable fragment of first order logic extended with counting quantifiers. The vocabularies of α...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997